package com.chuxuan.Math.Sort;

public class QuickSort extends Ordination{
        public	QuickSort(Integer[] ar){
            Sort(ar);
            System.out.println("-----------QuickSort-----------");
        }
        public int getMiddle(Integer[] list, int low, int high) {
            int tmp = list[low];    //数组的第一个作为中轴
            while (low < high) {
                while (low < high && list[high] >= tmp) {

                    high--;
                }
                list[low] = list[high];   //比中轴小的记录移到低端
                while (low < high && list[low] <= tmp) {
                    low++;
                }
                list[high] = list[low];   //比中轴大的记录移到高端
            }
            list[low] = tmp;              //中轴记录到尾
            return low;                   //返回中轴的位置
        }
        public void _quickSort(Integer[] list, int low, int high) {
            if (low < high) {
                int middle = getMiddle(list, low, high);  //将list数组进行一分为二
                _quickSort(list, low, middle - 1);        //对低字表进行递归排序
                _quickSort(list, middle + 1, high);       //对高字表进行递归排序
            }
        }
        public void quick(Integer[] a2) {
            if (a2.length > 0) {    //查看数组是否为空
                _quickSort(a2, 0, a2.length - 1);
            }
        }

    @Override
    public void Sort(Integer[] ar) {
        Integer a[]=ar.clone();
        quick(a);
        this.ar=a;
//		System.out.println(Arrays.toString( a));
    }
}
